Matrices with permanent equal to one
نویسندگان
چکیده
منابع مشابه
Determinants of Certain Classes of Zero-One Matrices with Equal Line Sums
We study the possible determinant values of various classes of n×n zero-one matrices with fixed row and column sums. Some new results, open problems, and conjectures are presented.
متن کاملPermanent Index of Matrices Associated with Graphs
A total weighting of a graph G is a mapping f which assigns to each element z ∈ V (G)∪E(G) a real number f(z) as its weight. The vertex sum of v with respect to f is φf (v) = ∑ e∈E(v) f(e) + f(v). A total weighting is proper if φf (u) 6= φf (v) for any edge uv of G. A (k, k′)-list assignment is a mapping L which assigns to each vertex v a set L(v) of k permissible weights, and assigns to each e...
متن کاملSmooth Projective Symmetric Varieties with Picard Number Equal to One
We classify the smooth projective symmetric varieties with Picard number equal to one. Moreover we prove a criterion for the smoothness of the simple (normal) symmetric varieties whose closed orbit is complete. In particular we prove that a such variety X is smooth if and only if an appropriate toric variety contained in X is smooth. A Gorenstein normal algebraic variety X over C is called a Fa...
متن کاملAsymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums
Let s, t,m, n be positive integers such that sm = tn. Let B(m, s;n, t) be the number of m×n matrices over {0, 1} with each row summing to s and each column summing to t. Equivalently, B(m, s;n, t) is the number of semiregular bipartite graphs with m vertices of degree s and n vertices of degree t. Define the density λ = s/n = t/m. The asymptotic value of B(m, s;n, t) has been much studied but t...
متن کاملMaximising the permanent and complementary permanent of (0, 1)-matrices with constant line sum
Let n denote the set of (0; 1)-matrices of order n with exactly k ones in each row and column. Let Ji be such that i = {Ji} and for A∈ n de ne A∈ n−k n by A = Jn − A. We are interested in the matrices in n which maximise the permanent function. Consider the sets M n = {A∈ n: per(A)¿per(B); for all B∈ n}; M k n = {A∈ n: per(A)¿per(B); for all B∈ n}: For k xed and n su ciently large we prove the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1975
ISSN: 0024-3795
DOI: 10.1016/0024-3795(75)90067-1